Eeective Continuous-time Formulation for Short-term Scheduling: I. Multipurpose Batch Processes

{During the last decade, the problem of production scheduling has been realized to be one of the most important problems in industrial plant operations especially when multipurpose/multiproduct batch processes are involved. This paper presents a novel mathematical formulation for the short-term scheduling of batch plants. The proposed formulation is based on a continuous time representation and results in a Mixed Integer Linear Programming (MILP) problem. The novel elements of the proposed formulation are (i) the decoupling of the task events from the unit events, (ii) the time sequencing constraints, and (iii) its linearity. In contrast to the previously presented continuous-time scheduling formulations , the proposed approach leads to smaller and simpler mathematical models which exhibit fewer binary and continuous variables, have smaller integrality gaps, require fewer constraints, need fewer linear programming relaxations, and can be solved in signiicantly less CPU time. Several examples are presented that illustrate the eeectiveness of the proposed formulation and comparisons with other approaches are provided.